Integer-Forcing Linear Receivers
نویسندگان
چکیده
منابع مشابه
Full-Diversity Space-Time Block Codes for Integer-Forcing Linear Receivers
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matched the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear ...
متن کاملInteger-Forcing Message Recovering in Interference Channels
In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-ofthe-art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combi...
متن کاملOptimal Factorization in Lattice-Reduction-Aided and Integer-Forcing Linear Equalization
Lattice-reduction-aided (LRA) equalization is a very interesting multi-user equalization technique as it enables a lowcomplexity full-diversity detection. To this end, the multipleinput/multiple-output channel is factorized into a reduced variant and a unimodular integer matrix. Inspired by the closely related finite-field processing strategy of integer-forcing (IF) equalization, this factoriza...
متن کاملLinear Daes with Nonsmooth Forcing
State transfer functions are derived for linear time invariant differential-algebraic equations of arbitrary index subject to insufficient smoothness in the forcing functions. As a result, it is demonstrated that the problem of reinitialization after discontinuities is always fully and uniquely determined. Algorithmic implementations and extensions to the linear time varying and nonlinear cases...
متن کاملInteger (Linear) Optimization
An amazing variety of activities and situations can be adequately modeled as linear optimization problems, also known as linear programs (LPs), or convex nonlinear optimization problems. Adequately means that the degree of approximation to reality that such a representation involves is acceptable. However, as the world that we inhabit is neither linear nor convex, the most common obstacle to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2361782